Computing Multiple Solutions of Topology Optimization Problems

نویسندگان

چکیده

Topology optimization problems often support multiple local minima due to a lack of convexity. Typically, gradient-based techniques combined with continuation in model parameters are used promot...

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of multiple solutions for Sturm-Liouville boundary value problems

In this paper, based on variational methods and critical point theory, we guarantee the existence of infinitely many classical solutions for a two-point boundary value problem with fourth-order Sturm-Liouville equation; Some recent results are improved and by presenting one example, we ensure the applicability of our results.

متن کامل

Computing near-optimal solutions to combinatorial optimization problems

In the past few years, there has been signiicant progress in our understanding of the extent to which near-optimal solutions can be ee-ciently computed for NP-hard combinatorial optimization problems. This paper surveys these recent developments, while concentrating on the advances made in the design and analysis of approximation algorithms, and in particular, on those results that rely on line...

متن کامل

Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems

In this chapter we discuss a wide class of combinatorial optimization problems with a linear sum and a bottleneck cost function. We first investigate the case when the weights in the problem are modeled as closed intervals. We show how the notion of optimality can be extended by using a concept of a deviation interval. In order to choose a solution we adopt a robust approach. We seek a solution...

متن کامل

Parallel Computing for Large-Scale Optimization Problems: Challenges and Solutions

Optimization refers to the minimization (or maximization) of an objective function of several decision variables that have to satisfy specified constraints. There are many applications of optimization. One example is the portfolio optimization problem where we seek the best way to invest some capital in a set of n assets. The constraints might represent a limit on the budget (i.e., a limit on t...

متن کامل

Approximation of topology optimization problems using sizing optimization problems

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i List of publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2021

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1326209